Domination, eternal domination and clique covering
نویسندگان
چکیده
منابع مشابه
Domination, eternal domination and clique covering
Eternal and m-eternal domination are concerned with using mobile guards to protect a graph against infinite sequences of attacks at vertices. Eternal domination allows one guard to move per attack, whereas more than one guard may move per attack in the m-eternal domination model. Inequality chains consisting of the domination, eternal domination, m-eternal domination, independence, and clique c...
متن کاملEternal domination: criticality and reachability
We show that for every minimum eternal dominating set, D, of a graph G and every vertex v ∈ D, there is a sequence of attacks at the vertices of G which can be defended in such a way that an eternal dominating set not containing v is reached. The study of the stronger assertion that such a set can be reached after a single attack is defended leads to the study of graphs which are critical in th...
متن کاملEternal domination on 3 × n grid graphs
In the eternal dominating set problem, guards form a dominating set on a graph and at each step, a vertex is attacked. After each attack, if the guards can “move” to form a dominating set that contains the attacked vertex, then the guards have successfully defended against the attack. We wish to determine the minimum number of guards required to successfully defend against any possible sequence...
متن کاملCapacitated Domination and Covering: A Parameterized Perspective
Capacitated versions of Vertex Cover and Dominating Set have been studied intensively in terms of polynomial time approximation algorithms. Although the problems Dominating Set and Vertex Cover have been subjected to considerable scrutiny in the parameterized complexity world, this is not true for their capacitated versions. Here we make an attempt to understand the behavior of the problems Cap...
متن کاملHypo-efficient domination and hypo-unique domination
For a graph $G$ let $gamma (G)$ be its domination number. We define a graph G to be (i) a hypo-efficient domination graph (or a hypo-$mathcal{ED}$ graph) if $G$ has no efficient dominating set (EDS) but every graph formed by removing a single vertex from $G$ has at least one EDS, and (ii) a hypo-unique domination graph (a hypo-$mathcal{UD}$ graph) if $G$ has at least two minimum dominating sets...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discussiones Mathematicae Graph Theory
سال: 2015
ISSN: 1234-3099,2083-5892
DOI: 10.7151/dmgt.1799